Categorifying connected domination via graph überhomology
نویسندگان
چکیده
Überhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, certain specialisation of überhomology, related to dominating sets in To this end, we interpret überhomology as poset and investigate its functoriality properties. then show the Euler characteristic graph coincides with an evaluation connected domination polynomial. Even more, chain complex retracts onto generated by sets. conclude several computations families graphs; these include vanishing result trees, characterisation complete
منابع مشابه
connected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملOn outer-connected domination for graph products
An outer-connected dominating set for an arbitrary graph G is a set D̃ ⊆ V such that D̃ is a dominating set and the induced subgraph G[V \ D̃] be connected. In this paper, we focus on the outerconnected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds f...
متن کاملConnected Cototal Domination Number of a Graph
A dominating setD ⊆ V of a graphG = (V,E) is said to be a connected cototal dominating set if 〈D〉 is connected and 〈V −D〉 6= ∅, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of D is connected cototal dominating set. The connected cototal domination number γccl(G) of G is the minimum cardinality of a minimal connected cototal dominati...
متن کاملTriple Connected Domination Number of a Graph
The concept of triple connected graphs with real life application was introduced in [7] by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called Smarandachely triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said to be Smarandachely triple connected dominating set, i...
متن کاملConnected Domination Number of a Graph and its Complement
A set S of vertices in a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γc(G) is the minimum size of such a set. Let δ(G) = min{δ(G), δ(G)}, where G is the complement of G and δ(G) is the minimum vertex degree. We prove that when G and G are both connected, γc(G) + γc(G) ≤...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2023
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2023.107381